Nondeterminism is essential in small two-way finite automata with few reversals
نویسنده
چکیده
On every n-long input, every two-way finite automaton (fa) can reverse its input head O(n) times before halting. A fawith few reversals is an automaton where this number is only o(n). For every h, we exhibit a language that can be recognized by an h-state nondeterministic fa with few reversals, but requires Ω(2) states on every deterministic fa with few reversals.
منابع مشابه
Nondeterminism Is Essential in Small 2FAs with Few Reversals
On every n-long input, every two-way finite automaton (fa) can reverse its head O(n) times before halting. A fawith few reversals is an automaton where this number is only o(n). For every h, we exhibit a language that requires Ω(2) states on every deterministic fa with few reversals, but only h states on a nondeterministic fa with few reversals.
متن کاملSubmission to ICALP 2011 Track B ( Topic : Automata Theory , Formal Languages )
On every n-long input, every two-way finite automaton (fa) can reverse its head O(n) times before halting. A fawith few reversals is an automaton where this number is only o(n). For every h, we exhibit a language that requires Ω(2) states on every deterministic fa with few reversals, but only h states on a nondeterministic fa with few reversals.
متن کاملNondeterminism is essential for reversal-bounded two-way multihead finite automata
It is proved for some "nice" function / that/(fl)-reversal-bounded two-way nondeterministic finite automata are more powerful than /(n)-reversal-bounded two-way deterministic ones. This solves a simplified extension of the well-known DLOG ? NLOG problem.
متن کاملReversal Hierarchies for Small 2DFAs
A two-way deterministic finite automaton with r(n) reversals performs ≤ r(n) input head reversals on every n-long input. Let 2D[r(n)] be all families of problems solvable by such automata of polynomial size. We prove that the reversal hierarchy 2D[0] ⊆ 2D[1] ⊆ 2D[2] ⊆ · · · is strict, but 2D[O(1)] = 2D[o(n)]. Moreover, the inner-reversal hierarchy 2D(0) ⊆ 2D(1) ⊆ 2D(2) ⊆ · · · , where now the b...
متن کاملTwo-Way Finite Automata with a Write-Once Track
The basic finite automata model has been extended over the years with different acceptance modes (nondeterminism, alternation), new or improved devices (two-way heads, pebbles, nested pebbles) and with cooperation. None of these additions permits recognition of non-regular languages. The purpose of this work is to investigate a new kind of automata which is inspired by an extension of 2DPDAs. M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 222 شماره
صفحات -
تاریخ انتشار 2013